Ks,t-saturated bipartite graphs
نویسندگان
چکیده
منابع مشابه
C4-saturated bipartite graphs
Let H be a graph. A graph G is said to be H -free if it contains no subgraph isomorphic to H . A graph G is said to be an H -saturated subgraph of a graph K if G is an H -free subgraph of K with the property that for any edge e∈E(K) \ E(G); G ∪ {e} is not H -free. We present some general results on Ks; t-saturated subgraphs of the complete bipartite graph Km;n and study the problem of 3nding, f...
متن کاملKs, t-saturated bipartite graphs
An n-by-n bipartite graph is H-saturated if the addition of any missing edge between its two parts creates a new copy of H. In 1964, Erdős, Hajnal and Moon made a conjecture on the minimum number of edges in a Ks,s-saturated bipartite graph. This conjecture was proved independently by Wessel and Bollobás in a more general, but ordered, setting: they showed that the minimum number of edges in a ...
متن کاملPm-saturated bipartite graphs with minimum size
A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and adding any new edge to G creates a copy of H in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pm) of Pm-saturated graph of order n. They gave the number sat(n;Pm) for n big enough. We deal with similar problem for bipartite graphs.
متن کاملPacking Bipartite Graphs with Covers of Complete Bipartite Graphs
For a set S of graphs, a perfect S-packing (S-factor) of a graph G is a set of mutually vertex-disjoint subgraphs of G that each are isomorphic to a member of S and that together contain all vertices of G. If G allows a covering (locally bijective homomorphism) to a graph H, i.e., a vertex mapping f : VG → VH satisfying the property that f(u)f(v) belongs to EH whenever the edge uv belongs to EG...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2015
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2014.10.003